A simple fast hybrid pattern-matching algorithm
نویسندگان
چکیده
منابع مشابه
A Simple Fast Hybrid Pattern-Matching Algorithm
The Knuth–Morris–Pratt (KMP) pattern-matching algorithm guarantees both independence from alphabet size and worst-case execution time linear in the pattern length; on the other hand, the Boyer–Moore (BM) algorithm provides near-optimal average-case and best-case behaviour, as well as executing very fast in practice. We describe a simple algorithm that employs the main ideas of KMP and BM (with ...
متن کاملA FAST Pattern Matching Algorithm
The advent of digital computers has made the routine use of pattern-matching possible in various applications. This has also stimulated the development of many algorithms. In this paper, we propose a new algorithm that offers improved performance compared to those reported in the literature so far. The new algorithm has been evolved after analyzing the well-known algorithms such as Boyer-Moore,...
متن کاملA Fast Multiple String-pattern Matching Algorithm
In this paper, we propose a simple but eecient multiple string pattern matching algorithm based on a compact encoding scheme. This algorithm scans text from left to right while encoding characters in the text based on the alphabet that occurs in the input patterns. The simple scanning algorithm demonstrates the ability to handle a very large number of input patterns simultaneously. Our experime...
متن کاملFast low-level pattern matching algorithm
This paper focuses on pattern matching in the DNA sequence. It was inspired by a previously reported method that proposes encoding both pattern and sequence using prime numbers. Although fast, the method is limited to rather small pattern lengths, due to computing precision problem. Our approach successfully deals with large patterns, due to our implementation that uses modular arithmetic. In o...
متن کاملA Simple Tree Pattern Matching Algorithm for Code Generator
This p a p e r descr ibes 4 s i m p l e t r ee p a t t e r n m a t c h i n g a l g o r i t h m f o r t h e code g e n e r a t o r of compi l e r s . T h e i n t e r m e d i a t e code ( R e g i s t e r T r a n s f e r L a n g u a g e ) is m a t c h e d with t h e tree-rewri t ing ru le s of t h e i n s t r u c t i o n d e s c r i p t i o n w h i c h describe t h e t a r g e t archi tecture t o ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2007
ISSN: 1570-8667
DOI: 10.1016/j.jda.2006.11.004